Non-reversible guided Metropolis kernel

نویسندگان

چکیده

Abstract We construct a class of non-reversible Metropolis kernels as multivariate extension the guided-walk kernel proposed by Gustafson ( Statist. Comput. 8 , 1998). The main idea our method is to introduce projection that maps state space totally ordered group. By using Haar measure, we novel Markov termed mixture kernel, which interest in its own right. This achieved inducing topological structure Our method, $\Delta$ -guided Metropolis–Haar constructed proposal kernel. at least 10 times better than random-walk and Hamiltonian Monte Carlo for logistic regression discretely observed stochastic process terms effective sample size per second.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Kernel Adaptive Metropolis-Hastings

A Kernel Adaptive Metropolis-Hastings algorithm is introduced, for the purpose of sampling from a target distribution with strongly nonlinear support. The algorithm embeds the trajectory of the Markov chain into a reproducing kernel Hilbert space (RKHS), such that the feature space covariance of the samples informs the choice of proposal. The procedure is computationally efficient and straightf...

متن کامل

A guided walk Metropolis algorithm

The random walk Metropolis algorithm is a simple Markov chain Monte Carlo scheme which is frequently used in Bayesian statistical problems. We propose a guided walk Metropolis algorithm which suppresses some of the random walk behavior in the Markov chain. This alternative algorithm is no harder to implement than the random walk Metropolis algorithm, but empirical studies show that it performs ...

متن کامل

On Non-reversible Markov Chains

Reversibility is a suucient but not necessary condition for Markov chains for use in Markov chain Monte Carlo simulation. It is necessary to select a Markov chain that has a pre-speciied distribution as its unique stationary distribution. There are many Markov chains that have such property. We give guidelines on how to rank them based on the asymptotic variance of the estimates they produce. T...

متن کامل

Weak Convergence of Metropolis Algorithms for Non-iid Target Distributions

In this paper, we shall optimize the efficiency of Metropolis algorithms for multidimensional target distributions with scaling terms possibly depending on the dimension. We propose a method to determine the appropriate form for the scaling of the proposal distribution as a function of the dimension, which leads to the proof of an asymptotic diffusion theorem. We show that when there does not e...

متن کامل

A generalized Multiple-try Metropolis version of the Reversible Jump algorithm

The Reversible Jump (RJ) algorithm (Green, 1995) is one of the most used Markov chain Monte Carlo algorithms for Bayesian estimation and model selection. We propose a generalized Multiple-try version of this algorithm which is based on drawing several proposals at each step and randomly choosing one of them on the basis of weights (selection probabilities) that may be arbitrary chosen. Along th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Applied Probability

سال: 2023

ISSN: ['1475-6072', '0021-9002']

DOI: https://doi.org/10.1017/jpr.2022.109